0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.12	% Command    : run_vampire %s %d THM
0.12/0.34	% Computer : n013.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1440
0.12/0.34	% WCLimit    : 180
0.12/0.34	% DateTime   : Thu Jul  4 05:57:39 EDT 2024
0.12/0.34	% CPUTime    : 
0.12/0.36	This is a THF_ problem
0.12/0.36	Running higher-order theorem proving
0.12/0.37	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.FccFpakjLb/E---3.1_16064.p -m 16384 -t 180
0.12/0.39	% (16174)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/27Mi)
0.12/0.39	% (16175)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/2Mi)
0.12/0.39	% (16172)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/183Mi)
0.12/0.39	% (16173)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/4Mi)
0.12/0.39	% (16176)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/2Mi)
0.12/0.39	% (16177)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/275Mi)
0.12/0.39	% (16178)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_16064 for (1799ds/18Mi)
0.12/0.39	% (16175)Instruction limit reached!
0.12/0.39	% (16175)------------------------------
0.12/0.39	% (16175)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.12/0.39	% (16175)Termination reason: Unknown
0.12/0.39	% (16175)Termination phase: shuffling
0.12/0.39	
0.12/0.39	% (16175)Memory used [KB]: 1023
0.12/0.39	% (16175)Time elapsed: 0.004 s
0.12/0.39	% (16175)Instructions burned: 3 (million)
0.12/0.39	% (16175)------------------------------
0.12/0.39	% (16175)------------------------------
0.12/0.39	% (16176)Instruction limit reached!
0.12/0.39	% (16176)------------------------------
0.12/0.39	% (16176)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.12/0.39	% (16176)Termination reason: Unknown
0.12/0.39	% (16176)Termination phase: Property scanning
0.12/0.39	
0.12/0.39	% (16176)Memory used [KB]: 1023
0.12/0.39	% (16176)Time elapsed: 0.004 s
0.12/0.39	% (16176)Instructions burned: 3 (million)
0.12/0.39	% (16176)------------------------------
0.12/0.39	% (16176)------------------------------
0.12/0.39	% (16173)Instruction limit reached!
0.12/0.39	% (16173)------------------------------
0.12/0.39	% (16173)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.12/0.39	% (16173)Termination reason: Unknown
0.12/0.39	% (16173)Termination phase: Property scanning
0.12/0.39	
0.12/0.39	% (16173)Memory used [KB]: 1023
0.12/0.39	% (16173)Time elapsed: 0.005 s
0.12/0.39	% (16173)Instructions burned: 4 (million)
0.12/0.39	% (16173)------------------------------
0.12/0.39	% (16173)------------------------------
0.12/0.39	% (16172)First to succeed.
0.12/0.40	% (16174)Also succeeded, but the first one will report.
0.23/0.40	% (16172)Refutation found. Thanks to Tanya!
0.23/0.40	% SZS status Theorem for E---3.1_16064
0.23/0.40	% SZS output start Proof for E---3.1_16064
0.23/0.40	thf(func_def_0, type, in: $i > ($i > $o) > $o).
0.23/0.40	thf(func_def_2, type, is_a: $i > ($i > $o) > $o).
0.23/0.40	thf(func_def_3, type, emptyset: $i > $o).
0.23/0.40	thf(func_def_4, type, unord_pair: $i > $i > $i > $o).
0.23/0.40	thf(func_def_5, type, singleton: $i > $i > $o).
0.23/0.40	thf(func_def_6, type, union: ($i > $o) > ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_7, type, excl_union: ($i > $o) > ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_8, type, intersection: ($i > $o) > ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_9, type, setminus: ($i > $o) > ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_10, type, complement: ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_11, type, disjoint: ($i > $o) > ($i > $o) > $o).
0.23/0.40	thf(func_def_12, type, subset: ($i > $o) > ($i > $o) > $o).
0.23/0.40	thf(func_def_13, type, meets: ($i > $o) > ($i > $o) > $o).
0.23/0.40	thf(func_def_14, type, misses: ($i > $o) > ($i > $o) > $o).
0.23/0.40	thf(func_def_15, type, fun_image: ($i > $i) > ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_16, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
0.23/0.40	thf(func_def_17, type, fun_inv_image: ($i > $i) > ($i > $o) > $i > $o).
0.23/0.40	thf(func_def_18, type, fun_injective: ($i > $i) > $o).
0.23/0.40	thf(func_def_19, type, fun_surjective: ($i > $i) > $o).
0.23/0.40	thf(func_def_20, type, fun_bijective: ($i > $i) > $o).
0.23/0.40	thf(func_def_21, type, fun_decreasing: ($i > $i) > ($i > $i > $o) > $o).
0.23/0.40	thf(func_def_22, type, fun_increasing: ($i > $i) > ($i > $i > $o) > $o).
0.23/0.40	thf(func_def_37, type, sK0: $i > $i).
0.23/0.40	thf(func_def_38, type, sK1: $i > $o).
0.23/0.40	thf(func_def_39, type, sK2: $i > $o).
0.23/0.40	thf(f142,plain,(
0.23/0.40	  $false),
0.23/0.40	  inference(avatar_sat_refutation,[],[f125,f133,f141])).
0.23/0.40	thf(f141,plain,(
0.23/0.40	  ~spl3_1),
0.23/0.40	  inference(avatar_contradiction_clause,[],[f140])).
0.23/0.40	thf(f140,plain,(
0.23/0.40	  $false | ~spl3_1),
0.23/0.40	  inference(subsumption_resolution,[],[f136,f109])).
0.23/0.40	thf(f109,plain,(
0.23/0.40	  ((sK0 @ sK5) = sK4)),
0.23/0.40	  inference(equality_proxy_clausification,[],[f105])).
0.23/0.40	thf(f105,plain,(
0.23/0.40	  ($true = ((sK0 @ sK5) = sK4))),
0.23/0.40	  inference(binary_proxy_clausification,[],[f104])).
0.23/0.40	thf(f104,plain,(
0.23/0.40	  ($true = (((sK1 @ sK5) & (sK2 @ sK5)) & ((sK0 @ sK5) = sK4)))),
0.23/0.40	  inference(beta_eta_normalization,[],[f103])).
0.23/0.40	thf(f103,plain,(
0.23/0.40	  ($true = ((^[Y0 : $i]: (((sK1 @ Y0) & (sK2 @ Y0)) & ((sK0 @ Y0) = sK4))) @ sK5))),
0.23/0.40	  inference(sigma_clausification,[],[f102])).
0.23/0.40	thf(f102,plain,(
0.23/0.40	  ((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) & (sK2 @ Y0)) & ((sK0 @ Y0) = sK4)))) = $true)),
0.23/0.40	  inference(binary_proxy_clausification,[],[f100])).
0.23/0.40	thf(f100,plain,(
0.23/0.40	  (((?? @ $i @ (^[Y0 : $i]: (((sK1 @ Y0) & (sK2 @ Y0)) & ((sK0 @ Y0) = sK4)))) => ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) & (?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4)))))) = $false)),
0.23/0.40	  inference(beta_eta_normalization,[],[f99])).
0.23/0.40	thf(f99,plain,(
0.23/0.40	  ($false = ((^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) & (sK2 @ Y1)) & ((sK0 @ Y1) = Y0)))) => ((?? @ $i @ (^[Y1 : $i]: ((sK1 @ Y1) & ((sK0 @ Y1) = Y0)))) & (?? @ $i @ (^[Y1 : $i]: ((sK2 @ Y1) & ((sK0 @ Y1) = Y0))))))) @ sK4))),
0.23/0.40	  inference(sigma_clausification,[],[f98])).
0.23/0.40	thf(f98,plain,(
0.23/0.40	  ((!! @ $i @ (^[Y0 : $i]: ((?? @ $i @ (^[Y1 : $i]: (((sK1 @ Y1) & (sK2 @ Y1)) & ((sK0 @ Y1) = Y0)))) => ((?? @ $i @ (^[Y1 : $i]: ((sK1 @ Y1) & ((sK0 @ Y1) = Y0)))) & (?? @ $i @ (^[Y1 : $i]: ((sK2 @ Y1) & ((sK0 @ Y1) = Y0)))))))) != $true)),
0.23/0.40	  inference(beta_eta_normalization,[],[f97])).
0.23/0.40	thf(f97,plain,(
0.23/0.40	  ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))) @ sK0 @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))) @ sK2 @ sK1)) @ ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))) @ sK0 @ sK2) @ ((^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))) @ sK0 @ sK1))))),
0.23/0.40	  inference(definition_unfolding,[],[f72,f79,f92,f84,f84,f92,f92])).
0.23/0.40	thf(f84,plain,(
0.23/0.40	  (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))),
0.23/0.40	  inference(cnf_transformation,[],[f52])).
0.23/0.40	thf(f52,plain,(
0.23/0.40	  (intersection = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ((Y1 @ Y2) & (Y0 @ Y2))))))))),
0.23/0.40	  inference(fool_elimination,[],[f51])).
0.23/0.40	thf(f51,plain,(
0.23/0.40	  (intersection = (^[X0 : $i > $o, X1 : $i > $o, X2 : $i] : ((X0 @ X2) & (X1 @ X2))))),
0.23/0.40	  inference(rectify,[],[f8])).
0.23/0.40	thf(f8,axiom,(
0.23/0.40	  (intersection = (^[X0 : $i > $o, X2 : $i > $o, X3 : $i] : ((X0 @ X3) & (X2 @ X3))))),
0.23/0.40	  file('/export/starexec/sandbox/tmp/tmp.FccFpakjLb/E---3.1_16064.p',intersection)).
0.23/0.40	thf(f92,plain,(
0.23/0.40	  (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))))),
0.23/0.40	  inference(cnf_transformation,[],[f64])).
0.23/0.40	thf(f64,plain,(
0.23/0.40	  (fun_image = (^[Y0 : $i > $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: (?? @ $i @ (^[Y3 : $i]: ((Y1 @ Y3) & ((Y0 @ Y3) = Y2))))))))))),
0.23/0.40	  inference(fool_elimination,[],[f63])).
0.23/0.40	thf(f63,plain,(
0.23/0.40	  ((^[X0 : $i > $i, X1 : $i > $o, X2 : $i] : (? [X3] : (((X0 @ X3) = X2) & (X1 @ X3)))) = fun_image)),
0.23/0.40	  inference(rectify,[],[f15])).
0.23/0.40	thf(f15,axiom,(
0.23/0.40	  ((^[X4 : $i > $i, X5 : $i > $o, X2 : $i] : (? [X0] : (((X4 @ X0) = X2) & (X5 @ X0)))) = fun_image)),
0.23/0.40	  file('/export/starexec/sandbox/tmp/tmp.FccFpakjLb/E---3.1_16064.p',fun_image)).
0.23/0.40	thf(f79,plain,(
0.23/0.40	  (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
0.23/0.40	  inference(cnf_transformation,[],[f50])).
0.23/0.40	thf(f50,plain,(
0.23/0.40	  (subset = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((Y0 @ Y2) => (Y1 @ Y2))))))))),
0.23/0.40	  inference(fool_elimination,[],[f49])).
0.23/0.40	thf(f49,plain,(
0.23/0.40	  ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((X0 @ X2) => (X1 @ X2)))) = subset)),
0.23/0.40	  inference(rectify,[],[f12])).
0.23/0.40	thf(f12,axiom,(
0.23/0.40	  ((^[X0 : $i > $o, X2 : $i > $o] : (! [X3] : ((X0 @ X3) => (X2 @ X3)))) = subset)),
0.23/0.40	  file('/export/starexec/sandbox/tmp/tmp.FccFpakjLb/E---3.1_16064.p',subset)).
0.23/0.40	thf(f72,plain,(
0.23/0.40	  ($true != (subset @ (fun_image @ sK0 @ (intersection @ sK2 @ sK1)) @ (intersection @ (fun_image @ sK0 @ sK2) @ (fun_image @ sK0 @ sK1))))),
0.23/0.40	  inference(cnf_transformation,[],[f71])).
0.23/0.40	thf(f71,plain,(
0.23/0.40	  ($true != (subset @ (fun_image @ sK0 @ (intersection @ sK2 @ sK1)) @ (intersection @ (fun_image @ sK0 @ sK2) @ (fun_image @ sK0 @ sK1))))),
0.23/0.40	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f69,f70])).
0.23/0.40	thf(f70,plain,(
0.23/0.40	  ? [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : ($true != (subset @ (fun_image @ X0 @ (intersection @ X2 @ X1)) @ (intersection @ (fun_image @ X0 @ X2) @ (fun_image @ X0 @ X1)))) => ($true != (subset @ (fun_image @ sK0 @ (intersection @ sK2 @ sK1)) @ (intersection @ (fun_image @ sK0 @ sK2) @ (fun_image @ sK0 @ sK1))))),
0.23/0.40	  introduced(choice_axiom,[])).
0.23/0.40	thf(f69,plain,(
0.23/0.40	  ? [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : ($true != (subset @ (fun_image @ X0 @ (intersection @ X2 @ X1)) @ (intersection @ (fun_image @ X0 @ X2) @ (fun_image @ X0 @ X1))))),
0.23/0.40	  inference(ennf_transformation,[],[f40])).
0.23/0.40	thf(f40,plain,(
0.23/0.40	  ~! [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : ($true = (subset @ (fun_image @ X0 @ (intersection @ X2 @ X1)) @ (intersection @ (fun_image @ X0 @ X2) @ (fun_image @ X0 @ X1))))),
0.23/0.40	  inference(fool_elimination,[],[f39])).
0.23/0.40	thf(f39,plain,(
0.23/0.40	  ~! [X0 : $i > $i,X1 : $i > $o,X2 : $i > $o] : (subset @ (fun_image @ X0 @ (intersection @ X2 @ X1)) @ (intersection @ (fun_image @ X0 @ X2) @ (fun_image @ X0 @ X1)))),
0.23/0.40	  inference(rectify,[],[f24])).
0.23/0.40	thf(f24,negated_conjecture,(
0.23/0.40	  ~! [X4 : $i > $i,X2 : $i > $o,X0 : $i > $o] : (subset @ (fun_image @ X4 @ (intersection @ X0 @ X2)) @ (intersection @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
0.23/0.40	  inference(negated_conjecture,[],[f23])).
0.23/0.40	thf(f23,conjecture,(
0.23/0.40	  ! [X4 : $i > $i,X2 : $i > $o,X0 : $i > $o] : (subset @ (fun_image @ X4 @ (intersection @ X0 @ X2)) @ (intersection @ (fun_image @ X4 @ X0) @ (fun_image @ X4 @ X2)))),
0.23/0.40	  file('/export/starexec/sandbox/tmp/tmp.FccFpakjLb/E---3.1_16064.p',thm)).
0.23/0.40	thf(f136,plain,(
0.23/0.40	  ((sK0 @ sK5) != sK4) | ~spl3_1),
0.23/0.40	  inference(trivial_inequality_removal,[],[f135])).
0.23/0.40	thf(f135,plain,(
0.23/0.40	  ($true = $false) | ((sK0 @ sK5) != sK4) | ~spl3_1),
0.23/0.40	  inference(superposition,[],[f108,f121])).
0.23/0.40	thf(f121,plain,(
0.23/0.40	  ( ! [X2 : $i] : (((sK1 @ X2) = $false) | (sK4 != (sK0 @ X2))) ) | ~spl3_1),
0.23/0.40	  inference(avatar_component_clause,[],[f120])).
0.23/0.40	thf(f120,plain,(
0.23/0.40	  spl3_1 <=> ! [X2] : ((sK4 != (sK0 @ X2)) | ((sK1 @ X2) = $false))),
0.23/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
0.23/0.40	thf(f108,plain,(
0.23/0.40	  ($true = (sK1 @ sK5))),
0.23/0.40	  inference(binary_proxy_clausification,[],[f106])).
0.23/0.40	thf(f106,plain,(
0.23/0.40	  ($true = ((sK1 @ sK5) & (sK2 @ sK5)))),
0.23/0.40	  inference(binary_proxy_clausification,[],[f104])).
0.23/0.40	thf(f133,plain,(
0.23/0.40	  ~spl3_2),
0.23/0.40	  inference(avatar_contradiction_clause,[],[f132])).
0.23/0.40	thf(f132,plain,(
0.23/0.40	  $false | ~spl3_2),
0.23/0.40	  inference(subsumption_resolution,[],[f128,f109])).
0.23/0.40	thf(f128,plain,(
0.23/0.40	  ((sK0 @ sK5) != sK4) | ~spl3_2),
0.23/0.40	  inference(trivial_inequality_removal,[],[f126])).
0.23/0.40	thf(f126,plain,(
0.23/0.40	  ($true = $false) | ((sK0 @ sK5) != sK4) | ~spl3_2),
0.23/0.40	  inference(superposition,[],[f107,f124])).
0.23/0.40	thf(f124,plain,(
0.23/0.40	  ( ! [X1 : $i] : (((sK2 @ X1) = $false) | ((sK0 @ X1) != sK4)) ) | ~spl3_2),
0.23/0.40	  inference(avatar_component_clause,[],[f123])).
0.23/0.40	thf(f123,plain,(
0.23/0.40	  spl3_2 <=> ! [X1] : (((sK0 @ X1) != sK4) | ((sK2 @ X1) = $false))),
0.23/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
0.23/0.40	thf(f107,plain,(
0.23/0.40	  ($true = (sK2 @ sK5))),
0.23/0.40	  inference(binary_proxy_clausification,[],[f106])).
0.23/0.40	thf(f125,plain,(
0.23/0.40	  spl3_1 | spl3_2),
0.23/0.40	  inference(avatar_split_clause,[],[f118,f123,f120])).
0.23/0.40	thf(f118,plain,(
0.23/0.40	  ( ! [X2 : $i,X1 : $i] : (((sK0 @ X1) != sK4) | ((sK2 @ X1) = $false) | (sK4 != (sK0 @ X2)) | ((sK1 @ X2) = $false)) )),
0.23/0.40	  inference(equality_proxy_clausification,[],[f117])).
0.23/0.40	thf(f117,plain,(
0.23/0.40	  ( ! [X2 : $i,X1 : $i] : ((((sK0 @ X2) = sK4) = $false) | ((sK0 @ X1) != sK4) | ((sK1 @ X2) = $false) | ((sK2 @ X1) = $false)) )),
0.23/0.40	  inference(equality_proxy_clausification,[],[f116])).
0.23/0.40	thf(f116,plain,(
0.23/0.40	  ( ! [X2 : $i,X1 : $i] : ((((sK0 @ X1) = sK4) = $false) | ((sK2 @ X1) = $false) | ((sK1 @ X2) = $false) | (((sK0 @ X2) = sK4) = $false)) )),
0.23/0.40	  inference(binary_proxy_clausification,[],[f115])).
0.23/0.40	thf(f115,plain,(
0.23/0.40	  ( ! [X2 : $i,X1 : $i] : ((((sK2 @ X1) & ((sK0 @ X1) = sK4)) = $false) | (((sK0 @ X2) = sK4) = $false) | ((sK1 @ X2) = $false)) )),
0.23/0.40	  inference(binary_proxy_clausification,[],[f114])).
0.23/0.40	thf(f114,plain,(
0.23/0.40	  ( ! [X2 : $i,X1 : $i] : ((((sK1 @ X2) & ((sK0 @ X2) = sK4)) = $false) | (((sK2 @ X1) & ((sK0 @ X1) = sK4)) = $false)) )),
0.23/0.40	  inference(beta_eta_normalization,[],[f113])).
0.23/0.40	thf(f113,plain,(
0.23/0.40	  ( ! [X2 : $i,X1 : $i] : ((((sK2 @ X1) & ((sK0 @ X1) = sK4)) = $false) | (((^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4))) @ X2) = $false)) )),
0.23/0.40	  inference(pi_clausification,[],[f112])).
0.23/0.40	thf(f112,plain,(
0.23/0.40	  ( ! [X1 : $i] : (((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false) | (((sK2 @ X1) & ((sK0 @ X1) = sK4)) = $false)) )),
0.23/0.40	  inference(beta_eta_normalization,[],[f111])).
0.23/0.40	thf(f111,plain,(
0.23/0.40	  ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4))) @ X1) = $false) | ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false)) )),
0.23/0.40	  inference(pi_clausification,[],[f110])).
0.23/0.40	thf(f110,plain,(
0.23/0.40	  ($false = (?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4))))) | ((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) = $false)),
0.23/0.40	  inference(binary_proxy_clausification,[],[f101])).
0.23/0.40	thf(f101,plain,(
0.23/0.40	  (((?? @ $i @ (^[Y0 : $i]: ((sK1 @ Y0) & ((sK0 @ Y0) = sK4)))) & (?? @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) & ((sK0 @ Y0) = sK4))))) = $false)),
0.23/0.40	  inference(binary_proxy_clausification,[],[f100])).
0.23/0.40	% SZS output end Proof for E---3.1_16064
0.23/0.40	% (16172)------------------------------
0.23/0.40	% (16172)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.23/0.40	% (16172)Termination reason: Refutation
0.23/0.40	
0.23/0.40	% (16172)Memory used [KB]: 5628
0.23/0.40	% (16172)Time elapsed: 0.009 s
0.23/0.40	% (16172)Instructions burned: 7 (million)
0.23/0.40	% (16172)------------------------------
0.23/0.40	% (16172)------------------------------
0.23/0.40	% (16171)Success in time 0.024 s
0.23/0.40	EOF